Pii: S0925-7721(98)00035-2
نویسندگان
چکیده
This paper studies the point location problem in Delaunay triangulations without preprocessing and additional storage. The proposed procedure finds the query point by simply “walking through” the triangulation, after selecting a “good starting point” by random sampling. The analysis generalizes and extends a recent result for d = 2 dimensions by proving this procedure takes expected time close to O(n1/(d+1)) for point location in Delaunay triangulations of n random points in d = 3 dimensions. Empirical results in both two and three dimensions show that this procedure is efficient in practice. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
An Edgebreaker-based efficient compression scheme for regular meshes
One of the most natural measures of regularity of a triangular mesh homeomorphic to the two-dimensional sphere is the fraction of its vertices having degree 6. We construct a linear-time connectivity compression scheme build upon Edgebreaker which explicitly takes advantage of regularity and prove rigorously that, for sufficiently large and regular meshes, it produces encodings not longer than ...
متن کاملIntersections with random geometric objects
We present a systematic study of the expected complexity of the intersection of geometric objects. We first study the expected size of the intersection between a random Voronoi diagram and a generic geometric object that consists of a finite collection of line segments in the plane. Using this result, we explore the intersection complexity of a random Voronoi diagram with the following target o...
متن کاملLabel placement by maximum independent set in rectangles
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follows. In O(n log n) time, we can nd an O(logn)-factor approximation of the maximum subset in a set of n arbitrary axis-parallel rectangles in the plane. If all rectangles have unit height, we can nd a 2-approximation in O...
متن کاملPii: S0925-7721(01)00068-2
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n logn) time. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کامل